A Kiefer-wolfowitz Algorithmbased Iterative Learning Control Forhammerstein-wienersystems
نویسندگان
چکیده
The iterative learning control (ILC) is considered for the HammersteinWiener (HW) system, which is a cascading system consisting of a static nonlinearity followed by a linear stochastic system and then a static nonlinearity. Except the structure, the system is unknown, but the system output is observed with additive noise. Both the linear and nonlinear parts of the system may be time-varying. The optimal control sequence under the tracking performance is first characterized, which, is however, unavailable since the system is unknown. By using the observations on system output the ILC is generated by a Kiefer-Wolfowitz (KW) algorithm with randomized differences, which aims at minimizing the tracking error. It is proved that ILC converges to the optimal one with probability one and the resulting tracking error tends to its minimal value.
منابع مشابه
A companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithm
A stochastic algorithm for the recursive approximation of the location θ of a maximum of a regression function has been introduced by Kiefer and Wolfowitz (1952) in the univariate framework, and by Blum (1954) in the multivariate case. The aim of this paper is to provide a companion algorithm to the Kiefer-Wolfowitz-Blum algorithm, which allows to simultaneously recursively approximate the size...
متن کاملGeneral Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm
We consider the Kiefer-Wolfowitz (KW) stochastic approximation algorithm and derive general upper bounds on its meansquared error. The bounds are established using an elementary induction argument and phrased directly in the terms of tuning sequences of the algorithm. From this we deduce the nonnecessity of one of the main assumptions imposed on the tuning sequences by Kiefer and Wolfowitz [Kie...
متن کاملKiefer Wolfowitz Algorithm is Asymptotically Optimal for a Class of Non-Stationary Bandit Problems
We consider the problem of designing an allocation rule or an “online learning algorithm” for a class of bandit problems in which the set of control actions available at each time t is a convex, compact subset of R. Upon choosing an action x at time t, the algorithm obtains a noisy value of the unknown and time-varying function ft evaluated at x. The “regret” of an algorithm is the gap between ...
متن کاملN ov 2 00 6 A Kiefer Wolfowitz Comparison Theorem For Wicksell ’ s Problem
We extend the isotonic analysis for the Wicksell’s problem to estimate a regression function, which is motivated by the problem of estimating dark matter distribution in Astronomy. The main result is a version of the Kiefer-Wolfowitz theorem comparing the empirical distribution to its least concave majorant, but with a convergence rate n −1 log n faster than n−2/3 log n. The main result is usef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012